package com.df.gamesynctest.test;

public class C {

    public static void main(String[] args) {
        System.out.println(C(5, 35)*C(2,12));
//        System.out.println(A(3, 3));

    }

    public static double C(int m,int n){
        long numerator =   A(m, n);	//分子

        long denominator = A(m, m)	;//分母

        return numerator / denominator;
    }
    public static long A(int m,int n){

        int res = 1;
        for (int i = m; i >= 1; i--) {
            res *= n;	//n × n-1 × n-2 × ... n-m，m就是需要减1的次数
            n--;
        }
        return res;
    }
}
